A Multicast Routing Protocol for Ad-Hoc Networks

نویسندگان

  • J. J. Garcia-Luna-Aceves
  • Ewerton L. Madruga
چکیده

The Core-Assisted Mesh Protocol (CAMP) is introduced for multicast routing in ad-hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multicast group; the main goal of using such meshes is to maintain the connectivity of multicast groups even while network routers move frequently. CAMP consists of the maintenance of multicast meshes and loop-free packet forwarding over such meshes. Within the multicast mesh of a group, packets from any source in the group are forwarded along the reverse shortest path to the source, just as in traditional multicast protocols based on source-based trees. CAMP guarantees that, within a finite time, every receiver of a multicast group has a reverse shortest path to each source of the multicast group. Multicast packets for a group are forwarded along the shortest paths from sources to receivers defined within the group’s mesh. CAMP uses cores only to limit the traffic needed for a router to join a multicast group; the failure of cores does not stop packet forwarding or the process of maintaining the multicast meshes. Keywords—Multicast routing protocol, ad-hoc networks, multicast mesh, mobility.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks

A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...

متن کامل

A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

متن کامل

An Anonymous Multicast Routing Protocol For Mobile Ad Hoc Networks

Anonymity is still a challenging issue in mobile ad hoc networks. Specially although operating as groups is required by many of ad hoc applications, there is only a little work on anonymous multicast routing algorithms. In this work we propose an Anonymous Multicast routing protocol for ad hoc networks called AnoMul based on the underlying unicast routing protocol ANODR proposed by J. Kong et a...

متن کامل

Intuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks

In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...

متن کامل

AMRIS: A Multicast Protocol for Ad hoc Wireless Networks

This paper introduces AMRIS, a new multicast routing protocol for ad hoc wireless networks. AMRIS (Ad hoc Multicast Routing protocol utilizing Increasing id-numberS) is designed to operate independently of underlying unicast

متن کامل

استفاده از خوشه بندی در پروتکل مسیریابی AODV برای شبکه های بین خودرویی بر روی سناریوی بزرگراه

Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network are considered as a big challenge For routing in these networks, routing protocols must be robust and reliable. AODV Routing pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999